Generalization and Reuse of Tactic
نویسندگان
چکیده
A tactic proof is a tree-structured sequent proof where steps may be justiied by tactic programs. We describe a prototype of a generic interactive theorem-proving system that supports the construction and manipulation of tactic proofs containing metavariables. The emphasis is on proof reuse. Examples of proof reuse are proof by analogy and reconstruction of partial proofs as part of recovering from errors in deeni-tions or in proof strategies. Our reuse operations involve solving higher-order uniication problems, and their eeectiveness relies on a proof-generalization step that is done after a tactic is applied. The prototype is implemented in Prolog.
منابع مشابه
Generalization and Reuse of Tactic Proofs
A tactic proof is a tree-structured sequent proof where steps may be justiied by tactic programs. We describe a prototype of a generic interactive theorem-proving system that supports the construction and manipulation of tactic proofs containing metavariables. The emphasis is on proof reuse. Examples of proof reuse are proof by analogy and reconstruction of partial proofs as part of recovering ...
متن کاملA Tabulation Transformation Tactic Using Haskell Arrays
In this paper we propose a transformation tactic that provides general tabulation of functional algorithms. This tabulation tactic can be applied to dependency graphs in which variable size cuts can be defined. The tactic can be considered a generalization of the tupling tactic proposed by other authors. Tables are dynamically created and their sizes determined at execution time. The tactic is ...
متن کاملA Pragmatic Approach to Reuse in Tactical Theorem Proving
In interactive theorem proving, tactics and tacticals have been introduced to automate proof search. In this scenario, user interaction traditionally is restricted to the mode in which the user decides which tactic to apply on the top-level, without being able to interact with the tactic once it has begun running. We propose a technique to allow the implementation of derivational analogy in tac...
متن کاملReuse of Proofs by Meta-methods
This paper describes a declarative approach for encoding the plan operators in proof planning, the so-called methods. The notion of method evolves from the much studied concept of a tactic and was rst used by A. Bundy. Signiic-ant deductive power has been achieved with the planning approach towards automated deduction ; however, the procedural character of the tactic part of methods hinders mec...
متن کاملA search engine for finding and reusing architecturally significant code
A Search Engine for Finding and Reusing Architecturally Significant Code Ibrahim Jameel Mujhid Supervising Professor: Dr. Mehdi Mirakhorli Architectural tactics are the building blocks of software architecture. They describe solutions for addressing specific quality concerns, and are prevalent across many software systems. Once a decision is made to utilize a tactic, the developer must generate...
متن کامل